Test sets and checking words for homomorphism equivalence
نویسندگان
چکیده
منابع مشابه
On Test Sets for Checking Morphism Equivalence on Languages with Fair Distribution of Letters
A test set for ;t language I. is J tinite subset T of L with the property that each pair of morphisms that agrees on 7 iilso agrees on L. Some results concerning te\t sets for languages with f,rir distribution of letters ilre presented. The first result is that every DOL language with fair distribution of Ictters has ,i test cet. The second result shows thst every lapage L with fair distributio...
متن کامل1 Model checking and equivalence checking
Owing to the advances in semiconductor technology, a large and complex system that has a wide variety of functionalities has been integrated on a single chip. It is called system-on-a-chip (SoC) or system LSI, since all of the components in an electronics system are built on a single chip. Designs of SoCs are highly complicated and require many manpower-consuming processes. As a result, it has ...
متن کاملEquivalence-checking for Reversible Circuits
Reversible circuits arise in bottlenecks of quantum algorithms, such as Shor’s and Grover’s. More generally, they offer a way to embed an arbitrary conventional computation into the quantum domain, where it can be performed on multiple input combinations at once. Performance optimizations modify reversible circuits for speed, depth and to abide by physical constraints, e.g., of spin-chain archi...
متن کاملChecking Equivalence for Reo Networks
Constraint automata have been used as an operational model for component connectors described in the coordination language Reo which specifies the cooperation and communication of the components by means of a network of channels. This paper addresses the problem of checking equivalence of two Reo networks. We present a compositional approach for the generation of a symbolic representation of co...
متن کاملLatch Inference for Equivalence Checking
A method for inferring latches from combinational loops in a netlist using boolean equations is proposed in this paper. The method takes advantage of the solutions structure of the latch loop boolean equation that allows us to obtain a phase and permutation independent procedure for latch inference. This method allows a better latch matching in equivalence checking tools.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computer and System Sciences
سال: 1980
ISSN: 0022-0000
DOI: 10.1016/0022-0000(80)90013-6